Decision trees, entropy, and the contrastive feature hierarchy

نویسندگان

چکیده

Dresher (2009) argues that language-particular hierarchies of features are the best way to identify contrastive in a phonological inventory. While not universal, this ordering is also fully unconstrained. But what limits space possible feature orders remains an open question. This paper demonstrates how concept entropy establishes partial both allows for but constrains variation. Specifically, decision tree machine learning algorithm employed dynamically impose structure on hypothesis orders.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Entropy and Decision Trees

We introduce an extension of the notion of Shannon conditional entropy to a more general form of conditional entropy that captures both the conditional Shannon entropy and a similar notion related to the Gini index. The proposed family of conditional entropies generates a collection of metrics over the set of partitions of finite sets, which can be used to construct decision trees. Experimental...

متن کامل

The contrastive hierarchy in phonology1

Since Saussure’s famous statement that “dans la langue il n’y a que des différences” (Saussure [1916] 1972: 166),2 the notion of contrast has been at the heart of linguistic theory. While it is relatively uncomplicated to deter mine whether or not two sounds are contrastive in a given language (though see Chomsky 1964), it is another matter to determine whether a given feature is contrastive in...

متن کامل

The contrastive hierarchy in phonology*

I will show that phonologists have vacillated between two different and incompatible approaches to determining whether a feature is contrastive in any particular phoneme. One approach involves extracting contrastive features from fully-specified minimal pairs. I will show that this approach is provably untenable. A second approach arrives at contrastive specifications by ordering features into ...

متن کامل

Feature Minimization within Decision Trees

Decision trees for classification can be constructed using mathematical programming. Within decision tree algorithms, the feature minimization problem is to construct accurate decisions using as few features or attributes within each decision as possible. Feature minimization is an important aspect of data mining since it helps identify what attributes are important and helps produce accurate a...

متن کامل

An asymmetric entropy measure for decision trees

In this paper we present a new entropy measure to grow decision trees. This measure has the characteristic to be asymmetric, allowing the user to grow trees which better correspond to his expectation in terms of recall and precision on each class. Then we propose decision rules adapted to such trees. Experiments have been realized on real medical data from breast cancer screening units.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Linguistic Society of America

سال: 2023

ISSN: ['2473-8689']

DOI: https://doi.org/10.3765/plsa.v8i1.5465